-
1 combinatorial optimization
Большой англо-русский и русско-английский словарь > combinatorial optimization
-
2 combinatorial optimization
Математика: комбинаторная оптимизацияУниверсальный англо-русский словарь > combinatorial optimization
-
3 combinatorial optimization
English-Russian electronics dictionary > combinatorial optimization
-
4 combinatorial optimization
The New English-Russian Dictionary of Radio-electronics > combinatorial optimization
-
5 combinatorial optimization
English-Russian scientific dictionary > combinatorial optimization
-
6 combinatorial optimization
The English-Russian dictionary on reliability and quality control > combinatorial optimization
-
7 combinatorial optimization problem with numerical input
Универсальный англо-русский словарь > combinatorial optimization problem with numerical input
-
8 optimization
-
9 optimization
- cache optimization
- combinatorial optimization
- computer-aided network optimization
- computer-aided transistor optimization
- constrained optimization
- continuous optimization
- global optimization
- hard disk optimization
- integer optimization
- memory optimization
- on-line optimization
- overall optimization
- possibilistic optimization
- scalar optimization
- security-constrained optimization
- vector optimization -
10 optimization
- cache optimization
- combinatorial optimization
- computer-aided network optimization
- computer-aided transistor optimization
- constrained optimization
- continuous optimization
- global optimization
- hard disk optimization
- integer optimization
- memory optimization
- on-line optimization
- overall optimization
- possibilistic optimization
- scalar optimization
- security-constrained optimization
- vector optimizationThe New English-Russian Dictionary of Radio-electronics > optimization
-
11 COPNI
combinatorial optimization problem with numerical input - комбинаторная задача оптимизации с цифровыми входными данными -
12 COPNI
-
13 algorithm
- ad hoc algorithm
- adaptive algorithm
- aim algorithm
- algorithm for path connections
- automatic assessment algorithm
- back-propagation algorithm
- banker's algorithm
- best-route algorithm
- bicomponent algorithm
- bipartitioning algorithm
- bisection algorithm
- branch-bound algorithm
- branching algorithm
- cascading algorithm
- chain algorithm
- channel router algorithm
- coarse-to-fine algorithm
- column sweep algorithm
- combinatorial algorithm
- computational algorithm
- computing algorithm
- conservative algorithm
- control algorithm
- convergent algorithm
- curve-fitting algorithm
- cutting-plane algorithm
- D-algorithm
- decision algorithm
- decoding algorithm
- demand-paging algorithm
- deterministic algorithm
- digit-by-digit algorithm
- divide-and-conquer algorithm
- double-sweep algorithm
- draphics algorithm
- drawing algorithm
- DSP algorithm
- dual algorithm
- durable algorithm
- earliest-deadline-first algorithm
- edge-based algorithm
- event-scheduling algorithm
- exchange algorithm
- fault-handling algorithm
- fine-to-coarse algorithm
- fixed-stealing algorithm
- fixed-step-size algorithm
- flow-synthesis algorithm
- forward-looking algorithm
- generalized algorithm
- genetic algorithm
- Goto algorithm
- graph algorithm
- graph traversal algorithm
- greedy algorithm
- grid expansion algorithm
- hardware algorithm
- heuristic algorithm
- Hightower algorithm
- incorrect algorithm
- inference-based algorithm
- inferencing algorithm
- instruction issue algorithm
- integer algorithm
- integrated query optimization algorithm
- iteration algorithm
- iterative algorithm
- layout algorithm
- layout copmaction algorithm
- leaky bucket algorithm
- learning algorithm
- least frequently used algorithm
- least recently used algorithm
- Lee-expansion algorithm
- Lee-type algorithm
- levelization algorithm
- linear expansion algorithm
- line-placing algorithm
- line-probe algorithm
- logical algorithm
- mathematically based algorithm
- mathematically intensive algorithm
- maximum matching algorithm
- mesh algorithm - minimum path-length algorithm
- modeling algorithm
- multikey algorithm
- multipass algorithm
- nested algorithm
- network algorithm
- normal algorithm
- no-wait algorithm
- operative algorithm
- optimal assignment algorithm
- optimal cutting algorithm
- ordering algorithm
- page-replacement algorithm
- paging algorithm
- parallel algorithm
- partitioning algorithm
- path-tracing algorithm
- pipeline algorithm
- pitch algorithm
- placement algorithm
- prediction algorithm
- primal-dual algorithm
- primary algorithm
- problem algorithm
- procrastination algorithm
- public-key algorithm
- quorum-based algorithm
- random search algorithm
- recognition algorithm
- recursive algorithm
- relaxation algorithm
- replicate algorithm
- robust algorithm
- round-robin algorithm
- routing algorithm
- scanline algorithm
- scheduling algorithm
- sequential algorithm
- shortest path algorithm
- shrinking algorithm
- simplex algorithm
- simulated annealing algorithm
- software algorithm
- spanning tree algorithm
- speech generation algorithm
- speed-enhancing algorithm
- square rooting algorithm
- steepest ascent algorithm
- systolic algorithm
- testing algorithm
- text-to-speech algorithm
- threshold decoding algorithm
- timetable scheduling algorithm
- trace back algorithm
- translation algorithm
- transportation algorithm
- tree-search algorithm
- two-dimensional placement algorithm
- two-list algorithm
- type-inferencing algorithm
- unconstrained minimization algorithm
- universal algorithm
- variable-stealing algorithm
- Vintr algorithm
- VLSI algorithm
- write-back algorithmEnglish-Russian dictionary of computer science and programming > algorithm
-
14 criterion
-
15 method
метод; процедура; способ- antithetic variate method - average ordinate method - average range method - binary search method - conjugate directions method - conjugate gradient method - control chart method - conventional milling method - correlation function method - decision function method - differential control method - Feynman diagram method - first approximation method - gradient projection method - iterative method - large sample method - large sieve method - least-squares regression method - less than fully efficient method - linearly implicit method - method of adjoint gradient - method of algebraic addition - method of alternating directions - method of balanced blocks - method of complex numbers - method of confidence intervals - method of conformal mappings - method of conjugate directions - method of conjugate gradients - method of cyclic descent - method of detached coefficients - method of disjunction of cases - method of divided differences - method of electrical images - method of elimination of quantifiers - method of empty ball - method of extreme values - method of false position - method of feasible directions - method of finite differences - method of first approximation - method of first entrance - method of fitting constants - method of fixed points - method of full enumeration - method of generating functions - method of geometric exhaustion - method of indefinite coefficients - method of infinite descent - method of interval bisection - method of least absolute values - method of least distance - method of least likelihood - method of maximum likelihood - method of means and standard deviations - method of medians and extreme values - method of minimal change - method of minimal variance - method of mirror reflections - method of moving frame - method of multiple comparison - method of orthogonal projections - method of paired associates - method of paired comparisons - method of phase integrals - method of projecting cones - method of proportional parts - method of rotating factors - method of semantic tableaux - method of separation of variables - method of simulaneous displacements - method of stationary phase - method of statistical differentials - method of statistical inference - method of steep variations - method of steepest ascent - method of stochastic approximation - method of straightforward iteration - method of successive displacements - method of successive divisions - method of successive elimination - method of transfinite induction - method of unweighted means - method of variable differences - method of variation of parameters - method of weighted residuals - optimum method - parallel tangents method - precision method - random walk method - recursive method - reduced gradient method - reflected wave method - relative method of measurement - sampling method by variables - statistical sampling method - steepest descent method - time average method -
16 model
1) макет; модель || моделировать2) образец4) модель, тип ( изделия)5) шаблон•- countably saturated model - countably uniform model - coupled channels model - finite state model - finitely generated model - game-theory model - random trial increment model - random walk model - sampling model -
17 problem
1) задача; проблема3) трудность, затруднение•- boundary value problem - card matching problem - central limit problem - decision problem under risk - decision problem under uncertainty - extremum problem - fair division problem - gambling problem - gasoline blending problem - incompletely structured problem - optimal path problem - optimal stopping problem - portfolio selection problem - precisely specified problem - recursively solvable problem - sequential decision programming problem - sequential occupancy problem - shortest path problem - shortest route problem - standard control problem - three houses and three wells problem -
18 procedure
1) мероприятие2) метод; методика4) операция5) компьют. подпрограмма6) процедура, порядок выполнения7) процесс• -
19 scheme
1) схема || составлять схему2) план; замысел || планировать, замышлять•- composite sampling scheme - decisive scheme - double sampling scheme - singly connected scheme -
20 technique
См. также в других словарях:
Combinatorial optimization — In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects.[1] In many such problems, exhaustive search is not feasible. It operates on… … Wikipedia
Combinatorial method — may refer to: Combinatorial method (linguistics), a method used for the study of unknown languages. For the use of combinatorial methods in mathematics, see Combinatorial principles. For the use of combinatorial methods in computer science, see… … Wikipedia
Optimization problem — In mathematics and computer science, an optimization problem is the problem of finding the best solution from all feasible solutions. Optimization problems can be divided into two categories depending on whether the variables are continuous or… … Wikipedia
Optimization (mathematics) — In mathematics, the term optimization, or mathematical programming, refers to the study of problems in which one seeks to minimize or maximize a real function by systematically choosing the values of real or integer variables from within an… … Wikipedia
optimization — /op teuh meuh zay sheuhn/ 1. the fact of optimizing; making the best of anything. 2. the condition of being optimized. 3. Math. a mathematical technique for finding a maximum or minimum value of a function of several variables subject to a set of … Universalium
Combinatorial data analysis — (CDA) is the study of data sets where the arrangement of objects is important. CDA can be used either to determine how well a given combinatorial construct reflects the observed data, or to search for a suitable combinatorial construct that does… … Wikipedia
Combinatorial auction — A combinatorial auction is a type of smart market in which participants can place bids on combinations of discrete items, or “packages,” rather than just individual items or continuous quantities. Simple combinatorial auctions have been used for… … Wikipedia
Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… … Wikipedia
Extremal optimization — (EO) is an optimization heuristic inspired by the Bak Sneppen model of self organized criticality from the field of statistical physics. This heuristic was designed initially to address combinatorial optimization problems such as the travelling… … Wikipedia
Ant colony optimization algorithms — Ant behavior was the inspiration for the metaheuristic optimization technique. In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be… … Wikipedia
Ordinal optimization — In mathematical optimization, ordinal optimization is the maximization of functions taking values in a partially ordered set ( poset ). Ordinal optimization has applications in the theory of queuing networks. Contents 1 Mathematical foundations 1 … Wikipedia
